A Theory of Reflexive Relational Generalization
نویسندگان
چکیده
We present the beginnings of an account of how representations and processes developed for the purposes of reflective reasoning provide a basis for reflexive reasoning as well. Specifically, we show how the symbolic-connectionist representations that underlie the DORA model (Doumas & Hummel, 2005), and the comparison based routines that DORA exploits in the service of addressing reflective problems, such as analogy making and the discovery of novel relations, can be extended to address reflexive reasoning phenomena. We use the reflexive reasoning routines developed in DORA to simulate findings demonstrating that reflexive processes operate when subjects solve real-world mathematics problems.
منابع مشابه
An Existence Results on Positive Solutions for a Remarks on k-Torsionless Modules
Let R be a commutative Noetherian ring. The k-torsionless modules are defined in [7] as a generalization of torsionless and reflexive modules, i.e., torsionless modules are 1-torsionless and reflexive modules are 2-torsionless. Some properties of torsionless, reflexive, and k-torsionless modules are investigated in this paper. It is proved that if M is an R-module such that G-dimR(M)
متن کاملReflexive digraphs with near unanimity polymorphisms
In this paper we prove that if a finite reflexive digraph admits Gumm operations, then it also admits a near unanimity operation. This is a generalization of similar results obtained earlier for posets and symmetric reflexive digraphs by the second author and his collaborators. In the special case of reflexive digraphs our new result confirms a conjecture of Valeriote that states that any finit...
متن کاملAlgebraic and Arithmetic Lattices . Part I 1
(1) Let L be a non empty reflexive transitive relational structure and x, y be elements of L. If x ≤ y, then compactbelow(x)⊆ compactbelow(y). (2) For every non empty reflexive relational structure L and for every element x of L holds compactbelow(x) is a subset of CompactSublatt(L). (3) For every relational structure L and for every relational substructure S of L holds every subset of S is a s...
متن کاملA symbolic-connectionist theory of relational inference and generalization.
The authors present a theory of how relational inference and generalization can be accomplished within a cognitive architecture that is psychologically and neurally realistic. Their proposal is a form of symbolic connectionism: a connectionist system based on distributed representations of concept meanings, using temporal synchrony to bind fillers and roles into relational structures. The autho...
متن کاملDuality in Relation Structures
The articles [15], [18], [19], [21], [20], [7], [8], [10], [1], [2], [6], [14], [11], [16], [12], [17], [3], [4], [23], [9], [5], [22], and [13] provide the terminology and notation for this paper. Let L be a relational structure. We introduce L as a synonym of L`. We now state several propositions: (1) For every relational structure L and for all elements x, y of L holds x ¬ y iff xx xy. (2)...
متن کامل